A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation
نویسندگان
چکیده
In this study we show by means of computational experiments that a pseudo-Boolean approach leads to a very compact presentation of p-Median problem instances which might be solved to optimality by a general purpose solver like CPLEX, Xpress, etc. Together with p-Median benchmark instances from OR and some other libraries we are able to solve to optimality many benchmark instances from cell formation in group technology which were tackled in the past only by means of different types of heuristics. Finally, we show that this approach is flexible to take into account many other practically motivated constraints in cell formation.
منابع مشابه
Study of buffer effects on the grouping efficacy measure of stochastic cell formation problem
This paper deals the stochastic cell formation problem (SCFP). The paper presents a new nonlinear integer programming model for the SCFP in which the effect of buffer size on the grouping efficacy of cells has been investigated. The objective function is the maximization of the grouping efficacy of cells. A chance constraint is applied to explore the effect of buffer on the SCFP. Processing tim...
متن کاملA two Stage Heuristic Solution Approach for Resource Assignment during a Cell Formation Problem
Design of Cellular Manufacturing System involves four major decisions: Cell formation (CF), Group layout (GL), Group scheduling (Gs) and Resource assignment (RA). These problems should be regarded, concurrently, in order to obtain an optimal solution in a CM environment. In this paper a two stage heuristic procedure is proposed for CF and RA decisions problem. The solution approach contains a ...
متن کاملIntegrative Cell Formation and Layout Design in Cellular Manufacturing Systems
This paper proposes a new integrative view of manufacturing cell formation and both inter-cell and intra-cell layout problems. Cells formation and their popular bi-directional linear layout are determined simultaneously through a Dynamic Programming algorithm (with the objective of minimizing the inter-cell flow cost under a cell size constraint). This Dynamic Programming algorithm is implement...
متن کاملImproving the Grenade Explosion Method in Solving the Dynamic Cell Formation Problem
Cell formation is the first and most important problem in designing cellular manufacturing systems. We have modeled the dynamic cell formation problem with respect to the minimization of the intercellular movement and cellular reconfiguration costs. Due to the nonpolynomiality of the cell formation models, a newly introduced metaheuristic namely the grenade explosion method (GEM) is applied t...
متن کاملRobust optimization of a mathematical model to design a dynamic cell formation problem considering labor utilization
Cell formation (CF) problem is one of the most important decision problems in designing a cellular manufacturing system includes grouping machines into machine cells and parts into part families. Several factors should be considered in a cell formation problem. In this work, robust optimization of a mathematical model of a dynamic cell formation problem integrating CF, production planning and w...
متن کامل